Upper Bounds on the Boolean Rank of Kronecker Products
نویسندگان
چکیده
منابع مشابه
On a Kronecker products sum distance bounds
Abstract— binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bound...
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
Theoretical Upper Bounds on the Covering Radii of Boolean Functions
We prove new upper bounds for the covering radii ρ(n) and ρB(n) of the first order Reed-Muller code R(1, n). Although these bounds be actually theoretical, they improve the classical Helleseth-Kløve-Mykkeltveit (H.K.M.) bound 2n−1 − 2n2−1.
متن کاملRank-deficient submatrices of Kronecker products of Fourier matrices
We provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrices A ⊗ B, and in particular the Kronecker product of Fourier matrices F = Fn1 ⊗ . . . ⊗ Fnk . We show how in the latter case, maximal rank-deficient submatrices can be constructedas tilings of rank-one blocks. Such tilings exist for any subgroup of a suitable Abelian group associated to the matrix F . The...
متن کاملUpper Bounds on Algebraic Immunity of Boolean Power Functions
Algebraic attacks have received a lot of attention in studying security of symmetric ciphers. The function used in a symmetric cipher should have high algebraic immunity (AI) to resist algebraic attacks. In this paper we are interested in finding AI of Boolean power functions. We give an upper bound on the AI of any Boolean power function and a formula to find its corresponding low degree multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2021
ISSN: ['1877-0509']
DOI: https://doi.org/10.1016/j.procs.2021.11.023